Realizations and LP
نویسنده
چکیده
LP can be seen as a logic of knowledge with justifications. Artemov’s Realization Theorem says justifications can be extracted from validities in the more conventional Hintikka-style logic of knowledge S4, in which they are not explicitly present. Justifications, however, are far from unique. There are many ways of realizing each theorem of S4 in the logic LP. If the machinery of justifications is to be applied to artificial intelligence, or better yet, to everyday reasoning, we will need to work with whatever justifications we may have at hand—one version may not be interchangeable with another, even though they realize the same S4 formula. In this paper we begin the process of providing tools for reasoning about justifications directly. The tools are somewhat complex, but in retrospect this should not be surprising. Among other things, we provide machinery for combining two realizations of the same formula, and for replacing subformulas by equivalent subformulas. (The second of these is actually weaker than just stated, but this is not the place for a detailed formulation.) The results are algorithmic in nature— semantics for LP plays no role. We apply our results to provide a new algorithmic proof of Artemov’s Realization Theorem itself.
منابع مشابه
A Replacement Theorem For LP
The replacement theorem for classical and normal modal logics is a fundamental tool. It says that if A and B have been proved equivalent, occurrences of A in a formula may be replaced with occurrences of B to produce a formula equivalent to the original one. This theorem does not hold for LP, Logic of Proofs. A replacement for replacement is not simple to formulate. In this note I have provided...
متن کاملTR-2006002: A Replacement Theorem for LP
The replacement theorem for classical and normal modal logics is a fundamental tool. It says that if A and B have been proved equivalent, occurrences of A in a formula may be replaced with occurrences of B to produce a formula equivalent to the original one. This theorem does not hold for LP, Logic of Proofs. A replacement for replacement is not simple to formulate. In this note I have provided...
متن کاملEducational Article:Gramians and Balanced Realizations and their Application in System Order Reduction
متن کامل
Educational Article:Gramians and Balanced Realizations and their Application in System Order Reduction
متن کامل
Efficient computation of the tangency portfolio by linear programming
In several problems of portfolio selection the reward-risk ratio criterion is optimized to search for a risky portfolio offering the maximum increase of the mean return, compared to the risk-free investment opportunities. In the classical model, following Markowitz, the risk is measured by the variance thus representing the Sharpe ratio optimization and leading to the quadratic optimization pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007